Inductive Counting for Width-Restricted Branching Programs
نویسندگان
چکیده
As an application of the inductive counting technique to a circuit-like model, we prove that complementation on nondeterministic branching programs can be done without increasing the width too much. A consequence of this result is that the class of languages recognized by a generalization of nonuniform nite automata (Barrington (1989)) to non-constant space is closed under complement.
منابع مشابه
Counting paths in planar width 2 branching programs
We revisit the problem of counting paths in width-2 planar branching programs. We show that this is hard for Boolean NC under ACC[5] reductions, completing a proof strategy outlined in [3]. On the other hand, for several restricted instances of width-2 planar branching programs, we show that the counting problem is TC-complete. We also show that nonplanar width-2 programs can be planarized in A...
متن کاملInductive Counting below LOGSPACE
We apply the inductive counting technique to nondetermin-istic branching programs and prove that complementation on this model can be done without increasing the width of the branching programs too much. This shows that for an arbitrary space bound s(n), the class of languages accepted by nonuniform nondeterministic O(s(n)) space bounded Turing machines is closed under complementation. As a con...
متن کاملA Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width
Recently, an interest in constructing pseudorandom or hitting set generators for restricted branching programs has increased, which is motivated by the fundamental issue of derandomizing space-bounded computations. Such constructions have been known only in the case of width 2 and in very restricted cases of bounded width. In this paper, we characterize the hitting sets for read-once branching ...
متن کاملAlmost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs
Recently, an interest in constructing pseudorandom or hitting set generators for restricted branching programs has increased, which is motivated by the fundamental problem of derandomizing space bounded computations. Such constructions have been known only in the case of width 2 and in very restricted cases of bounded width. In our previous work, we have introduced a so-called richness conditio...
متن کاملA Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3
The relationship between deterministic and probabilistic computations is one of the central issues in complexity theory. This problem can be tackled by constructing polynomial time hitting set generators which, however, belongs to the hardest problems in computer science even for severely restricted computational models. In our work, we consider read-once branching programs for which such a con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 130 شماره
صفحات -
تاریخ انتشار 1996